منابع مشابه
Graphs with Bounded Induced Distance
In this work we introduce the class of graphs with bounded induced distance of order k, (BID(k) for short). A graph G belongs to BID(k) if the distance between any two nodes in every connected induced subgraph of G is at most k times their distance in G. These graphs can model communication networks in which node failures may occur: at a given time, if sender and receiver are still connected, a...
متن کاملGraphs with Bounded Induced Distance Sera no Cicerone
In this work we introduce the class of graphs with bounded induced distance of order k, (BID(k) for short). A graph G belongs to BID(k) if the distance between any two nodes in every connected induced subgraph of G is at most k times their distance in G. These graphs can model communication networks in which node failures may occur: at a given time, if sender and receiver are still connected, a...
متن کاملMinimum survivable graphs with bounded distance increase
We study in graphs a property related to fault-tolerance in case a node fails. A graph G is k-self-repairing, where k is a non-negative integer, if after the removal of any vertex no distance in the surviving graph increase by more than k. We give upper and lower bounds on the minimum number of edges of a k-self-repairing graph for prescribed k and n, where n is the order of the graph. We also ...
متن کاملD-bounded Distance-regular Graphs
Let Γ = (X, R) denote a distance-regular graph with diameter D ≥ 3 and distance function δ. A (vertex) subgraph ∆ ⊆ X is said to be weak-geodetically closed whenever for all x, y ∈ ∆ and all z ∈ X, δ(x, z) + δ(z, y) ≤ δ(x, y) + 1 −→ z ∈ ∆. Γ is said to be D-bounded whenever for all x, y ∈ X, x, y are contained in a common regular weak-geodetically closed subgraph of diameter δ(x, y). Assume Γ i...
متن کاملQuerying Shortest Path Distance with Bounded Errors in Large Graphs
Shortest paths and shortest path distances are important primary queries for users to query in a large graph. In this paper, we propose a new approach to answer shortest path and shortest path distance queries efficiently with an error bound. The error bound is controlled by a user-specified parameter, and the online query efficiency is achieved with prepossessing offline. In the offline prepro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2001
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(00)00227-4